Papers by Noe Fabian Hsueh
Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching (2025.acl-short)
Copied to clipboard
Juan Wisznia, Cecilia Bolaños, Juan Tollo, Giovanni Franco Gabriel Marraffini, Agustín Andrés Gianolini, Noe Fabian Hsueh, Luciano Del Corro
| Challenge: | a new framework for analyzing sorting algorithms in pairwise ranking prompting (PRP) is developed to re-center the cost model around LLM inferences rather than traditional pairwise comparisons. |
| Approach: | They propose a framework for analyzing sorting algorithms in pairwise ranking prompting (PRP) they propose to re-center the cost model around LLM inferences rather than traditional pairwise comparisons. |
| Outcome: | The proposed framework encourages strategies such as batching and caching to mitigate inference costs. |